Efficient Modular Squaring Algorithms for Hardware Implementation in GF(p)

A Novel and Efficient Hardware Implementation of Scalar Point Multiplier

A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical path...

Efficient Modular Division Implementation

Elliptic Curve Public Key Cryptosystems (ECPKC) are becoming increasingly popular for use in mobile appliances where bandwidth and chip area are strongly constrained. For the same level of security, ECPKC use much smaller key length than the commonly used RSA. The underlying operation of affine coordinates elliptic curve point multiplication requires modular multiplication, division/inversion a...

Specialized Hardware for Implementation of Evolutionary Algorithms

Evolutionary Algorithms (EAs) are getting more and more popular and many successful applications of these principles have been reported. One of the major drawbacks of these approaches in general is that they are often not competitive with respect to runtime in comparison to other methods. A natural way to speed up these algorithms and to handle large problem instances are parallel implementatio...

Transformation of Rendering Algorithms for Hardware Implementation

Hardware Implementation of Montgomery's Modular Multiplication Algorithm

Hardware is described for implementing the fast modular multiplication algorithm of P. L. Montgomery. Comparison with previous techniques shows that his method is up to twice as fast as the best currently available, as well as being more suitable for alternative architectures. The gain in speed arises from the faster clock which results from simpler combinational logic.